The reducible complexity of a mitochondrial molecular machine.
نویسندگان
چکیده
Molecular machines drive essential biological processes, with the component parts of these machines each contributing a partial function or structural element. Mitochondria are organelles of eukaryotic cells, and depend for their biogenesis on a set of molecular machines for protein transport. How these molecular machines evolved is a fundamental question. Mitochondria were derived from an alpha-proteobacterial endosymbiont, and we identified in alpha-proteobacteria the component parts of a mitochondrial protein transport machine. In bacteria, the components are found in the inner membrane, topologically equivalent to the mitochondrial proteins. Although the bacterial proteins function in simple assemblies, relatively little mutation would be required to convert them to function as a protein transport machine. This analysis of protein transport provides a blueprint for the evolution of cellular machinery in general.
منابع مشابه
On the reducible $M$-ideals in Banach spaces
The object of the investigation is to study reducible $M$-ideals in Banach spaces. It is shown that if the number of $M$-ideals in a Banach space $X$ is $n(<infty)$, then the number of reducible $M$-ideals does not exceed of $frac{(n-2)(n-3)}{2}$. Moreover, given a compact metric space $X$, we obtain a general form of a reducible $M$-ideal in the space $C(X)$ of continuous functions on $X$. The...
متن کاملWhat Can be Efficiently Reduced to the Kolmogorov-Random Strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings RC. We show that this question cannot be posed without explicitly dealing with issues raised by the choice of universal machine in the definition of Kolmogorov complexity. Among other results, we show that although for ...
متن کاملCuriouser and Curiouser: The Link between Incompressibility and Complexity
This talk centers around some audacious conjectures that attempt to forge firm links between computational complexity classes and the study of Kolmogorov complexity. More specifically, let R denote the set of Kolmogorov-random strings. Let BPP denote the class of problems that can be solved with negligible error by probabilistic polynomial-time computations, and let NEXP denote the class of pro...
متن کاملSelectivity and Self - Reducibility : NewCharacterizations of Complexity
It is known that a set is in P ii it is p-time Turing self-reducible and p-selective 2] and a p-time Turing self-reducible set is in NP \ coNP ii it is NP-selective 4]. We generalize these new characterizations to arbitrary time complexity classes. A simple and direct proof for the result of 2] is obtained. Probabilistic selectivity is also studied.
متن کاملAnalysis of mitochondrial DNA sequences of Turcinoemacheilus genus (Nemacheilidae Cypriniformes) in Iran
Members of Nemacheilidae Family, Turcinoemacheilus genus were subjected to molecular phylogenetic analysis in this study. This genus was reported in 2009 to inhabit in Karoon River drainage, in contrary to previous assumption that it was the endemic species in the Basin of Tigris River. It was sampled from three stations placed in different tributaries in Karoon drainage and evaluated to unders...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 106 37 شماره
صفحات -
تاریخ انتشار 2009